- graph shape
- n.Kurvenverlauf m.
English-german dictionary. 2013.
English-german dictionary. 2013.
Graph — (gr[.a]f), n. [See { graph}.] (Math.) 1. A curve or surface, the locus of a point whose co[ o]rdinates are the variables in the equation of the locus; as, a graph of the exponential function. [Webster 1913 Suppl.] 2. A diagram symbolizing a… … The Collaborative International Dictionary of English
Shape table — Shape tables were a powerful yet little used feature of Applesoft BASIC allowing for simple graphic manipulation on Apple II series computers, using the hi res graphics mode.The vectors of a two dimensional graphic, each encoding a direction from … Wikipedia
Shape analysis — This article describes shape analysis to analyze and process geometric shapes. The shape analysis described here is related to the statistical analysis of geometric shapes, to shape matching and shape recognition. It applies purely to the… … Wikipedia
graph — /graf, grahf/, n. 1. a diagram representing a system of connections or interrelations among two or more things by a number of distinctive dots, lines, bars, etc. 2. Math. a. a series of points, discrete or continuous, as in forming a curve or… … Universalium
bar graph — Graph Graph (gr[.a]f), n. [See { graph}.] (Math.) 1. A curve or surface, the locus of a point whose co[ o]rdinates are the variables in the equation of the locus; as, a graph of the exponential function. [Webster 1913 Suppl.] 2. A diagram… … The Collaborative International Dictionary of English
Scene graph — A scene graph is a general data structure commonly used by vector based graphics editing applications and modern computer games. Examples of such programs include AutoCAD, Adobe Illustrator, Acrobat 3D, OpenSceneGraph and CorelDRAW.The scene… … Wikipedia
Dürer graph — Melencolia I by Albrecht Dürer, the first appearance of Dürer s solid (1514). In the mathematical field of graph theory, the Dürer graph is an undirected graph with 12 vertices and 18 edges. It is named after Albrecht Dürer, whose 1514 engraving… … Wikipedia
Reeb graph — In Morse theory, a branch of mathematics, a Reeb graph of a scalar function describes the connectivity of its level sets.[1]Reeb graphs are named after Georges Reeb. If the function is defined over a vector space rather than over a more general… … Wikipedia
Quantum graph — In mathematics and physics, a quantum graph is a linear, network shaped structure whose time evolution is described by a system of schrödinger equations or, more generally, by a set of evolution equations associated with differential or pseudo… … Wikipedia
Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia